package a07_二叉树;

/**
 * <p>
 * a31_修剪二叉搜索树复习2
 * </p>
 *
 * @author flyduck
 * @since 2025/4/23
 */
public class a31_修剪二叉搜索树复习2 {
    public TreeNode trimBST(TreeNode root, int low, int high) {
        if (root == null) {
            return null;
        }

        if(root.val < low){
            return trimBST(root.right, low, high);
        }else if(root.val > high){
            return trimBST(root.left, low, high);
        }else {
            root.left = trimBST(root.left, low, high);
            root.right = trimBST(root.right, low, high);
            return root;
        }
    }
}
